例句與造句

1. Other connections to unparameterised computational complexity are that FPT equals " W " [ " P " ] if and only if circuit satisfiability can be decided in time \ exp ( o ( n ) ) m ^ { O ( 1 ) }, or if and only if there is a computable, nondecreasing, unbounded function f such that all languages recognised by a nondeterministic polynomial-time Turing machine using f ( n ) log n nondeterministic choices are in " P ".
2. It's difficult to find circuit satisfiability in a sentence. 用circuit satisfiability造句挺難的